#include "BinaryTree.h"

int main()
{
	char a[] = "ABD##E#H##CF##G##";
	int n = sizeof(a) / sizeof(a[0]);
	int i = 0;
	BTNode* root = BinaryTreeCreate(a, n, &i);
	BinaryTreePrevOrder(root);
	printf("\n");
	BinaryTreeInOrder(root);
	printf("\n");
	BinaryTreePostOrder(root);
	printf("\n");

	printf("%d", BinaryTreeLeafSize(root));
	printf("%p",BinaryTreeFind(root, 'B'));
	return 0;
}